A Cultural Algorithm with Operator Parameters Control for Solving Timetabling Problems
نویسندگان
چکیده
A cultural algorithm, together with a set of new operators for the timetabling problem(TP), is proposed in this paper. The new operators extract information about the problem during the evolutionary process, and they are combined with some previously proposed operators, in order to improve the performance of the algorithm. The proposed algorithm is tested with a benchmark of 20 instances, and compared with respect to three other algorithms: two evolutionary algorithms and a simulated annealing algorithm which won an international competition
منابع مشابه
Hybrid artificial intelligence technique for solving large, highly constrained timetabling problems
Timetabling problems are often hard and time-consuming to solve. Profits from full automatization of this process can be invaluable. Although over the years many solutions have been proposed, most of the methods concern only one problem instance or class. This paper describes a possibly universal method for solving large, highly constrained timetabling problems from different areas. The solutio...
متن کاملUniversal Method for Solving Timetabling Problems Based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and employs tabu search to speed up the solution finding...
متن کاملUniversal Method for Timetable Construction based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and operates on two levels – first-level evolutionary algorithm tries ...
متن کاملA Study of Genetic Algorithms to Solve the School Timetabling Problem
This paper examines the use of genetic algorithms (GAs) to solve the school timetabling problem. The school timetabling problem falls into the category of NP-hard problems. Instances of this problem vary drastically from school to school and country to country. Previous work in this area has used genetic algorithms to solve a particular school timetabling problem and has not evaluated the perfo...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007